Performance analysis of the AntNet algorithm
نویسندگان
چکیده
A number of routing algorithms based on the ant-colony metaphor have been proposed for communication networks. However, there has been little work on the performance analysis of ant-routing algorithms. In this paper, we compare the performance of AntNet, an ant-routing algorithm, with Dijkstra’s shortest path algorithm. Our simulations show that the performance of AntNet is comparable to Dijkstra’s shortest path algorithm. Moreover, under varying traffic loads, AntNet adapts to the changing traffic and performs better than shortest path routing. 2006 Elsevier B.V. All rights reserved.
منابع مشابه
AntNet: A Mobile Agents Approach to Adaptive Routing
This paper introduces AntNet, a new routing algorithm for communications networks. AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor. We apply AntNet to a datagram network and compare it with both static and adaptive state-of-the-art routing algorithms. We ran experiments for various paradigmatic temporal and spatial t...
متن کاملTWO ANT COLONY ALGORITHMS FOR BEST-EFFORT ROUTING IN DATAGRAM NETWORKS GIANNI DI CARO and MARCO DORIGO
In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...
متن کاملReinforcement Optimization to Implement AntNet-Based Routing on Packet Forwarding Engines
AntNet is an adaptive agent-based routing algorithm that imitates the activities of the social insect. In previous works, the efficiency of the AntNet algorithm has been verified in dynamic traffic environments. In spite of this merit, its implementation has been limited till now. There are implementation constraints due to complex arithmetic calculations for determining a reinforcement value a...
متن کاملAntNet: Routing Algorithm for Data Networks based on Mobile Agents
AntNet is an innovative algorithm for packet routing in communication networks, originally proposed by M. Dorigo and G. Di Caro, in 1997. In AntNet, a group of mobile agents (or artificial ants) build paths between pair of nodes, exploring the network concurrently and exchanging obtained information to update the routing tables. This work analyzes AntNet and proposes improvements that were impl...
متن کاملTwo Ant Colony Algorithms for Best-effort Routing in Datagram Networks
In this paper we present two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks. AntNet is a distributed multi-agent system inspired by the stigmergy model of communication observed in ant colonies. We report simulation results for AntNet on realistically sized networks using as performance measures throughput, packet delays an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Networks
دوره 51 شماره
صفحات -
تاریخ انتشار 2007